Solving the permutation flow shop problem with blocking and setup time constraints
نویسندگان
چکیده
منابع مشابه
An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملMILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints
In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...
متن کاملSolving a Permutation Flow Shop Problem with Blocking and Transportation Delays
Given a job set J = f1; 2; :::; ng where each job has to be processed non preemptively on m machines M1; M2;..., Mm in that order. The processing time of job j on machine Mi is pij : At time t = 0; all jobs are available at an input device denoted by M0: After completion, each job must be taken from Mm to an output device denoted Mm+1 (for convenience, we set pm+1;j = 0;8j 2 J): The transfer be...
متن کاملan iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time criteria
in this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. the steps of this algorithm are designed very efficient. for generating an initial solution, we develop an efficient constructive heuristic by modifying the best known neh algorithm. effectiveness of the proposed iterated greedy algorithm is t...
متن کاملSolving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times
Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Industrial Engineering Computations
سال: 2020
ISSN: 1923-2926,1923-2934
DOI: 10.5267/j.ijiec.2019.11.002